Deadline - Cost Constraint Task Scheduling for Soft - Real Time Systems
نویسنده
چکیده
Cloud computing is a nascent technology which widely spreads among researchers. It provides users with infrastructure, platform and software as amenity which is effortlessly accessible via Internet. In cloud computing, there are numerous tasks needs to be executed by the existing resources to attain best performance, shortest response time, minimal total time for completion, utilization of resources etc. Due to these dissimilar objectives, we need to design, develop a noble scheduling strategy to outperform proper division of tasks on virtual machines. Recently existing scheduling algorithm may work proficiently in some perspective. But they are unable to achieve deadline of task and attain maximum profit. Based on the concept of space-shared scheduling policy, this paper presents cost-deadline based scheduling to schedule tasks with Cloud-sim by taking into account several parameters including task profit, task penalty, and throughput.
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملSchedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on ...
متن کاملAn Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster-Group EDF
In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is propos...
متن کاملMultiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗
In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...
متن کاملFuzzy EDF Algorithm for Soft Real Time Systems
EDF is a classic dynamic embedded realtime multi-task scheduling algorithm. In an embedded soft real-time system, the deadline missing ratio is an important metric to evaluate system performance. When an embedded soft realtime system is overloaded, EDF algorithm is not effective. Considering the unsteadiness and unpredictability of a practical task running environment due to the unsteadiness of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015